Computing Zernike polynomials of arbitrary degree using the discrete Fourier transform
نویسندگان
چکیده
The conventional representation of Zernike polynomials Rn (ρ) gives unacceptable numerical results for large values of the degree n. We present an algorithm for the computation of Zernike polynomials of arbitrary degree n. The algorithm has the form of a discrete Fourier (cosine) transform which comes with advantages over other methods in terms of computation time, accuracy and ease of implementation. As an application we consider the effect of NA-scaling on the lower-order aberrations of an optical system in the presence of a very high order aberration. [DOI: 10.2971/jeos.2007.07012]
منابع مشابه
A general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملA New Formulation of the Fast Fractional Fourier Transform
By using a spectral approach, we derive a Gaussian-like quadrature of the continuous fractional Fourier transform. The quadrature is obtained from a bilinear form of eigenvectors of the matrix associated to the recurrence equation of the Hermite polynomials. These eigenvectors are discrete approximations of the Hermite functions, which are eigenfunctions of the fractional Fourier transform oper...
متن کاملA new algorithm for computing SAGBI bases up to an arbitrary degree
We present a new algorithm for computing a SAGBI basis up to an arbitrary degree for a subalgebra generated by a set of homogeneous polynomials. Our idea is based on linear algebra methods which cause a low level of complexity and computational cost. We then use it to solve the membership problem in subalgebras.
متن کاملWavefront Reconstruction from Slope Data Within Pupils of Arbitrary Shapes Using Iterative Fourier Transform
This letter presents a new modal technique that reconstructs a wavefront using iterative Fourier transforms and converts the Fourier coefficients as needed to and from the coefficients of the orthonormal basis set over pupils of arbitrary shapes. It is shown that, for wavefront slope data, modal reconstruction with Fourier series using an iterative algorithm is faster and more accurate than whe...
متن کاملBessel-zernike discrete variable representation basis.
The connection between the Bessel discrete variable basis expansion and a specific form of an orthogonal set of Jacobi polynomials is demonstrated. These so-called Zernike polynomials provide alternative series expansions of suitable functions over the unit interval. Expressing a Bessel function in a Zernike expansion provides a straightforward method of generating series identities. Furthermor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007